Discrete valued fields with infinite uB$ $-invariant: research announcement
نویسندگان
چکیده
منابع مشابه
Integer-valued polynomial in valued fields with an application to discrete dynamical systems
Integer-valued polynomials on subsets of discrete valuation domains are well studied. We undertake here a systematical study of integer-valued polynomials on subsets S of valued fields and of several connected notions: the polynomial closure of S, the Bhargava’s factorial ideals of S and the v-orderings of S. A sequence of numbers is naturally associated to the subset S and a good description c...
متن کاملPERIOD-INDEX AND u-INVARIANT QUESTIONS FOR FUNCTION FIELDS OVER COMPLETE DISCRETELY VALUED FIELDS
Let K be a complete discretely valued field with residue field κ and F the function field of a curve over K. Let p be the characteristic of κ and l a prime not equal to p. If the Brauer l-dimensions of all finite extensions of κ are bounded by d and the Brauer l-dimensions of all extensions of κ of transcendence degree at most 1 are bounded by d + 1, then it is known that the Brauer l-dimension...
متن کاملDynamic quantizer synthesis based on invariant set analysis for SISO systems with discrete-valued input
This paper proposes analysis and synthesis methods of dynamic quantizers for linear feedback single input single output (SISO) systems with discrete-valued input in terms of invariant set analysis. First, this paper derives the quantizer analysis and synthesis conditions that clarify an optimal quantizer within the ellipsoidal invariant set analysis framework. In the case of minimum phase feedb...
متن کاملFUZZY HYPERVECTOR SPACES OVER VALUED FIELDS
In this note we first redefine the notion of a fuzzy hypervectorspace (see [1]) and then introduce some further concepts of fuzzy hypervectorspaces, such as fuzzy convex and balance fuzzy subsets in fuzzy hypervectorspaces over valued fields. Finally, we briefly discuss on the convex (balanced)hull of a given fuzzy set of a hypervector space.
متن کاملMaximal Infinite-Valued Constraint Languages
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1989
ISSN: 0035-7596
DOI: 10.1216/rmj-1989-19-3-601